algorithms undirected graph twodegree[]

Posted by notamathwiz on Stack Overflow See other posts from Stack Overflow or by notamathwiz
Published on 2013-11-01T03:33:27Z Indexed on 2013/11/01 3:54 UTC
Read the original article Hit count: 111

Filed under:
|

For each node u in an undirected graph, let twodegree[u] be the sum of the degrees of u's neighbors. Show how to compute the entire array of twodegree[.] values in linear time, given a graph in adjacency list format.

This is the solution

for all u ?  V :
  degree[u] = 0
  for all (u; w) ?  E:
    degree[u] = degree[u] + 1
for all u ?  V :
  twodegree[u] = 0
  for all (u; w) ?  E:
    twodegree[u] = twodegree[u] + degree[w]

can someone explain what degree[u] does in this case and how twodegree[u] = twodegree[u] + degree[w] is supposed to be the sum of the degrees of u's neighbors?

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about pseudocode